An Improved Bound on the List Error Probability and List Distance Properties
نویسندگان
چکیده
منابع مشابه
An upper bound on the zero-error list-coding capacity
We present an upper bound on the zero-error list-coding capacity of discrete memoryless channels. Using this bound, we show that the list-3 capacity of the 4 /3 channel is at most 0.3512 b, improving the best previous bound. The relation of the bound to earlier similar bounds, in particular, to Korner’s graph-entropy bound, is discussed.
متن کاملImproved Skips for Faster Postings List Intersection
Information retrieval can be achieved through computerized processes by generating a list of relevant responses to a query. The document processor, matching function and query analyzer are the main components of an information retrieval system. Document retrieval system is fundamentally based on: Boolean, vector-space, probabilistic, and language models. In this paper, a new methodology for mat...
متن کاملImproved Skips for Faster Postings List Intersection
Information retrieval can be achieved through computerized processes by generating a list of relevant responses to a query. The document processor, matching function and query analyzer are the main components of an information retrieval system. Document retrieval system is fundamentally based on: Boolean, vector-space, probabilistic, and language models. In this paper, a new methodology for mat...
متن کاملA Combinatorial Bound on the List Size
We provide a simple, closed-form upper bound for the classical problem of worst case list-size of a general q-ary block code. This new bound improves upon the best known general bound when the alphabet of the code is large. We also show that with parameters of Reed-Solomon codes this bound is very close to the algebraic bound derived using the constructions of the Guruswami-Sudan decoder.
متن کاملAn Improved Bound on the List Size in the Guruswami-sudan Algorithm for Ag Codes
Given an algebraic geometry code CL(D,αP ), the GuruswamiSudan algorithm produces a list of all codewords in CL(D,αP ) within a specified distance of a received word. The initialization step in the algorithm involves parameter choices that bound the degree of the interpolating polynomial and hence the length of the list of codewords generated. In this paper, we use simple properties of discrimi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2008
ISSN: 0018-9448
DOI: 10.1109/tit.2007.911176